On Necessary and Sufficient Conditions for Private Ballot Submission

نویسندگان

  • David Bernhard
  • Olivier Pereira
  • Bogdan Warinschi
چکیده

We exhibit the precise security guarantees that a public key encryption scheme needs to satisfy to guarantee ballot privacy when used in a large class of voting systems. We also identify new security notions for public key encryption that characterize the number of times that a public key can be used in different elections, and show that the most common ballot preparation approach that consists in encrypting the vote and adding a NIZK proof of its validity is sound, even without hardwiring the voter identity in the proof. Our results provide important steps towards proving the privacy of the ballot submission procedure in the widely deployed Helios voting system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ballot Secrecy and Ballot Independence Coincide

We study ballot independence for election schemes: – We formally define ballot independence as a cryptographic game and prove that ballot secrecy implies ballot independence. – We introduce a notion of controlled malleability and show that it is sufficient for ballot independence. We also show that non-malleable ballots are sufficient, but not necessary, for ballot independence. – We prove that...

متن کامل

Ballot secrecy and ballot independence: definitions and relations

We study ballot independence for election schemes. First, we formally define ballot independence as a cryptographic game and prove that ballot secrecy implies ballot independence. Secondly, we introduce a notion of controlled malleability and prove that it is sufficient for ballot independence. We also prove that non-malleable ballots are sufficient for ballot independence. Thirdly, we prove th...

متن کامل

Ballot secrecy: Security definition, sufficient conditions, and analysis of Helios

We propose a definition of ballot secrecy as an indistinguishability game in the computational model of cryptography. Our definition builds upon and strengthens earlier definitions to ensure ballot secrecy is preserved in the presence of an adversary that controls ballot collection. We also propose definitions of ballot independence as adaptations of nonmalleability and indistinguishability gam...

متن کامل

Weighted composition operators between Lipschitz algebras of complex-valued bounded functions

‎In this paper‎, ‎we study weighted composition operators between Lipschitz algebras of complex-valued bounded functions on metric spaces‎, ‎not necessarily compact‎. ‎We give necessary and sufficient conditions for the injectivity and the surjectivity of these operators‎. ‎We also obtain sufficient and necessary conditions for a weighted composition operator between these spaces to be compact.

متن کامل

Lexical Cohesion and Literariness in Malcolm X's " The Ballot or the Bullet"

This paper unearths the contribution of lexical cohesion to the textuality and overall meaning of Malcolm X’s speech 'The Ballot or the Bullet'. Drawing on Halliday and Hasan’s (1976) and Hoey’s (1991) theory of cohesion, specifically lexical   cohesion, whose main thrust is the role of lexical items in not only contributing to meaning but also serving as cohesive ties, the paper discusses how ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012